Compilation and Approximation of Conjunctive Queries by Concept Descriptions
نویسندگان
چکیده
In this paper, we characterize the logical correspondence between conjunctive queries and concept descriptions. We exhibit a necessary and sufficient condition for the compilation of a conjunctive query into an equivalent ALE concept description. We provide a necessary and sufficient condition for the approximation of conjunctive queries by maximally subsumed ALN concept descriptions.
منابع مشابه
Compilation and Approximation of ConjunctiveQueries
In this paper, we characterize the logical correspondence between conjunctive queries and concept descriptions. We exhibit a necessary and suucient condition for the compilation of a conjunctive query into an equivalent ALE concept description. We provide a necessary and suucient condition for the approximation of conjunctive queries by maximally subsumed ALN concept descriptions.
متن کاملMassively Parallel Support for Computationally Effective Recognition Queries
PARKA is a frame-based knowledge representation system implemented on the Connection Machine. PARKA provides a representation language consisting of concept descriptions (frames) and binary relations on those descriptions (slots). The system is designed explicitly to provide extremely fast property inheritance inference capabilities. In particular, PARKA can perform fast "recognition" queries o...
متن کاملBoolean Affine Approximation with Binary Decision Diagrams
Selman and Kautz’s work on knowledge compilation has established how approximation (strengthening and/or weakening) of a propositional knowledgebase can be used to speed up query processing, at the expense of completeness. In the classical approach, the knowledge-base is assumed to be presented as a propositional formula in conjunctive normal form (CNF), and Horn functions are used to overand u...
متن کاملSingular Referring Expressions in Conjunctive Query Answers: the case for a CFD DL Dialect
A referring expression in linguistics is any noun phrase identifying an object in a way that will be useful to interlocutors. In the context of conjunctive queries over a description logic knowledge base (DL KB), typically constant symbols (usually treated as rigid designators) are used as referring expressions in a certain answer to the query. In this paper, we begin to explore how this can be...
متن کاملComputing Intensions of Digital Library Collections
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion of a collection: the concept extent is the extension of the collection; the concept intent consists of a set of terms, the collection intension. The collection intension can be viewed as a simple conjunctive query whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002